Probabilistic Query Answering in the Bayesian Description Logic BEL
نویسندگان
چکیده
BEL is a probabilistic description logic (DL) that extends the light-weight DL EL with a joint probability distribution over the axioms, expressed with the help of a Bayesian network (BN). In recent work it has been shown that the complexity of standard logical reasoning in BEL is the same as performing probabilistic inferences over the BN. In this paper we consider conjunctive query answering in BEL. We study the complexity of the three main problems associated to this setting: computing the probability of a query entailment, computing the most probable answers to a query, and computing the most probable context in which a query is entailed. In particular, we show that all these problems are tractable w.r.t. data and ontology complexity.
منابع مشابه
Query Answering in Bayesian Description Logics
The Bayesian Description Logic (BDL) BEL is a probabilistic DL, which extends the lightweight DL EL by defining a joint probability distribution over EL axioms with the help of a Bayesian network (BN). In the recent work, extensions of standard logical reasoning tasks in BEL are shown to be reducible to inferences in BNs. This work concentrates on a more general reasoning task, namely on conjun...
متن کاملReasoning in the Description Logic BEL Using Bayesian Networks
We study the problem of reasoning in the probabilistic Description Logic BEL. Using a novel structure, we show that probabilistic reasoning in this logic can be reduced in polynomial time to standard inferences over a Bayesian network. This reduction provides tight complexity bounds for probabilistic reasoning in BEL.
متن کاملThe Bayesian Description Logic BEL
We introduce the probabilistic Description Logic BEL. In BEL, axioms are required to hold only in an associated context. The probabilistic component of the logic is given by a Bayesian network that describes the joint probability distribution of the contexts. We study the main reasoning problems in this logic; in particular, we (i) prove that deciding positive and almost-sure entailments is not...
متن کاملTowards Log-Linear Logics with Concrete Domains
We present MEL (M denotes Markov logic networks) an extension of the log-linear description logics EL-LL with concrete domains, nominals, and instances. We use Markov logic networks (MLNs) in order to find the most probable, classified and coherent EL ontology from an MEL knowledge base. In particular, we develop a novel way to deal with concrete domains (also known as datatypes) by extending M...
متن کاملThe Bayesian Ontology Reasoner is BORN!
Bayesian ontology languages are a family of probabilistic ontology languages that allow to encode probabilistic information over the axioms of an ontology with the help of a Bayesian network. The Bayesian ontology language BEL is an extension of the lightweight Description Logic (DL) EL within the above-mentioned framework. We present the system BORN that implements the probabilistic subsumptio...
متن کامل